Mathematical invariants in people's probabilistic reasoning
نویسندگان
چکیده
Recent research has identified three invariants or identities that appear to hold in people’s probabilistic decision making: the addition law identity, the Bayes rule identity, and the QQ identity (Costello and Watts, 2014, Fisher and Wolfe, 2014, Costello and Watts, 2016b, Wang and Busemeyer, 2013, Wang et al., 2014). Each of these identities represent specific agreement with the requirements of normative probability theory; strikingly, these identities seem to hold in people’s probability judgments despite the presence of strong and systematic biases against the requirements of normative probability theory in those very same judgments. We assess the degree to which two formal models of probabilistic reasoning (the ‘probability theory plus noise’ model and the ‘quantum probability’ model) can explain these identities and biases in probabilistic reasoning.
منابع مشابه
Development of Rabin Choice Coordination in Event-B
We continue the investigation with the integration of qualitative probabilistic reasoning into Event-B further towards the direction of having a tool support. In passing by, we formalise a non-trivial algorithm, namely Rabin’s choice coordination. Our correctness reasoning is a combination of termination proofs in terms of probabilistic convergence and standard invariants techniques. Moreover, ...
متن کاملSurprisingly rational: probability theory plus noise explains biases in judgment.
The systematic biases seen in people's probability judgments are typically taken as evidence that people do not use the rules of probability theory when reasoning about probability but instead use heuristics, which sometimes yield reasonable judgments and sometimes yield systematic biases. This view has had a major impact in economics, law, medicine, and other fields; indeed, the idea that peop...
متن کاملPrinsys – a Software Tool for the Synthesis of Probabilistic Invariants
We are interested in aiding correctness proofs for probabilistic programs, i.e. While programs, enriched with a probabilistic choice operator “[p]” that executes the left alternative with probability p and the right alternative with 1− p. There are tools for non-probabilistic programs that generate invariants for verification purposes [2, 1]. For probabilistic programs the existing tools rely o...
متن کاملno-homomorphism conditions for hypergraphs
In this paper, we define some new homomorphism-monotone parameters for hypergraphs. Using these parameters, we extend some graph homomorphism results to hypergraph case. Also, we present some bounds for some well-known invariants of hypergraphs such as fractional chromatic number,independent numer and some other invariants of hyergraphs, in terms of these parameters.
متن کاملSplice Graphs and their Vertex-Degree-Based Invariants
Let G_1 and G_2 be simple connected graphs with disjoint vertex sets V(G_1) and V(G_2), respectively. For given vertices a_1in V(G_1) and a_2in V(G_2), a splice of G_1 and G_2 by vertices a_1 and a_2 is defined by identifying the vertices a_1 and a_2 in the union of G_1 and G_2. In this paper, we present exact formulas for computing some vertex-degree-based graph invariants of splice of graphs.
متن کامل